An Ore-type Condition for Cyclability
نویسندگان
چکیده
منابع مشابه
An Ore-type Condition for Cyclability
Let G = (V (G), E(G)) be a finite simple graph without loops. The neighbourhood N (v) of a vertex v is the set of vertices adjacent to v. The degree d(v) of v is |N (v)|. The minimum and maximum degree of G are denoted by δ(G) and 1(G), respectively. For a vertex v ∈ V (G) and a subset S ⊆ V (G), NS(v) is the set of neighbours of v contained in S, i.e., NS(v) = N (v) ∩ S. We let dS(v) = |NS(v)|...
متن کاملAn Ore-type condition for arbitrarily vertex decomposable graphs
Let G be a graph of order n and r , 1 ≤ r ≤ n, a fixed integer. G is said to be r -vertex decomposable if for each sequence (n1, . . . , nr ) of positive integers such that n1 + · · · + nr = n there exists a partition (V1, . . . , Vr ) of the vertex set of G such that for each i ∈ {1, . . . , r}, Vi induces a connected subgraph of G on ni vertices. G is called arbitrarily vertex decomposable if...
متن کاملAn Ore-type sufficient condition for a bipancyclic ordering
Hendry, G.R.T., An Ore-type sufficient condition for a bipancyclic ordering, Discrete Mathematics 102 (1992) 47-49. It is shown that if G(X, Y, E) is a bipartite graph with 1X1= IYI = n Z= 2 in which d(x) + d(y) 2 n + 1 whenever x E X, y E Y, and xy $ E then, unless n is odd and G is one exceptional graph, G has a bipancyclic ordering, i.e. the vertices of X and Y can be labelled x,, . , x, and...
متن کاملAn Implicit Degree Condition for Cyclability in Graphs
A vertex subset X of a graph G is said to be cyclable in G if there is a cycle in G containing all vertices of X. Ore [6] showed that the vertex set of G with cardinality n ≥ 3 is cyclable (i.e. G is hamiltonian) if the degree sum of any pair of nonadjacent vertices in G is at least n. Shi [8] and Ota [7] respectively generalized Ore’s result by considering the cyclability of any vertex subset ...
متن کاملOre-type degree condition of supereulerian digraphs
A digraph D is supereulerian if D has a spanning directed eulerian subdigraph. Hong et al. proved that δ(D) + δ(D) ≥ |V (D)| − 4 implies D is supereulerian except some well-characterized digraph classes if the minimum degree is large enough. In this paper, we characterize the digraphs D which are not supereulerian under the condition d+D (u) + d−D (v) ≥ |V (D)| − 4 for any pair of vertices u an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2001
ISSN: 0195-6698
DOI: 10.1006/eujc.2001.0517